#include "avltree.h"
#include "myalgorithm.h"

#include <iostream>
using namespace std;

int main()
{
//	AvlTree<int> iAt;

	int arr[] = {4, -3, 5, -2, -1, 2, 6, -2, 9, -10, 23, 12, 0, -12};
	vector<int> v(arr, arr+(sizeof(arr)/sizeof(int)));
	quickSort(v);

	cout << sizeof(void*) << endl;

	return 0;
}